Distribution Testing Lower Bounds via Reductions from Communication Complexity
نویسندگان
چکیده
منابع مشابه
Distribution Testing Lower Bounds via Reductions from Communication Complexity
We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model. Extending the framework of Blais, Brody, and Matulef [15], we show a simple way to reduce (private-coin) SMP problems to distribution testing problems. This method allows us to prove new distribution te...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملLower Bounds in Communication Complexity
The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph survey lower bou...
متن کامل5 Lower Bounds on Circuits via Communication Complexity
Notation 3.1 As usual the term circuit means family of circuits, one for each n. All circuits will alternate AND and OR gates. There will be no NOT gates; however, both inputs and their negations are available. The depth of a circuit is the longest path from input to output. The fan-in of a circuit is the max number of inputs to a gate. The size of a circuits is the number of gates. A (d, f, s)...
متن کاملLower Bounds for Approximating Graph Parameters via Communication Complexity
In a celebrated work, Blais, Brody, and Matulef [5] developed a technique for proving property testing lower bounds via reductions from communication complexity. Their work focused on testing properties of functions, and yielded new lower bounds as well as simplified analyses of known lower bounds. Here, we take a further step in generalizing the methodology of [5] to analyze the query complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2019
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3305270